On the Effectiveness of Polynomial Realization of Reed-Solomon Codes for Storage Systems

摘要

There are different ways to realize Reed Solomon (RS) codes. While in thestorage community, using the generator matrices to implement RS codes is morepopular, in the coding theory community the generator polynomials are typicallyused to realize RS codes. Prominent exceptions include HDFS-RAID, which usesgenerator polynomial based erasure codes, and extends the Apache Hadoop's filesystem. In this paper we evaluate the performance of an implementation of polynomialrealization of Reed-Solomon codes, along with our optimized version of it,against that of a widely-used library (Jerasure) that implements the mainmatrix realization alternatives. Our experimental study shows that despitesignificant performance gains yielded by our optimizations, the polynomialimplementations' performance is constantly inferior to those of matrixrealization alternatives in general, and that of Cauchy bit matrices inparticular.